A Union Authentication Protocol of Cross-domain Based on Bilinear Pairing

نویسندگان

  • Shen-Gang Hao
  • Li Zhang
  • Muhammad Ghulam
چکیده

With the development of network service technology such as grid computing, cloud computing, the cooperation among multiply domains is needed for these intelligent services that have the unlimited space and the unlimited speed. This paper proposes a new union authentication protocol of cross-domain that can ensure the security of resource access in different domains, where the register keys of members in one domain are submitted to the key authentication center, rather than the private keys. This authentication protocol can avoid the shortcoming that it is complex to deliver certification in the traditional crossdomain authentication based on PKI and prevent the authority counter from pretending to be a member to access resources in other domains in the current identity-based authentication. The performance analysis shows that the proposed authentication protocol has good anonymity and can track the entities when there are the inconsistent cases. At last, a prototype system that can implement the authentication protocol is given.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Cryptanalysis of a Deniable Authentication Protocol based on Bilinear Pairing using Single Sender and Group Sender

The aim of an efficient deniable authentication protocol is to enable a receiver to identify the source of a given message but not to prove the identity of the sender. Lu and Cao [7,10] confirmed that the previous protocols had a common weakness in which any third party can impersonate the intended receiver to verify the signature of the given message, and they proposed a new protocol based on ...

متن کامل

Convertible limited (multi-) verifier signature: new constructions and applications

A convertible limited (multi-) verifier signature (CL(M)VS) provides controlled verifiability and preserves the privacy of the signer. Furthermore, limited verifier(s) can designate the signature to a third party or convert it into a publicly verifiable signature upon necessity. In this proposal, we first present a generic construction of convertible limited verifier signature (CLVS) into which...

متن کامل

A Cross-Domain Alliance Authentication Scheme based on Bilinear Group

With the development of grid computing, cloud computing and other large distributed network technology, users need them to provide services of unlimited space and unlimited speed. In order to meeting this request of users, all the domains in these large distributed networks need coordination for each other. For ensuring the safety to access resources in all domains, we propose a crossdomain uni...

متن کامل

IEEE 1363.3 Submission: Implicitly Authenticated ID-Based Key Agreement Protocol

In this submission, we propose an efficient identity-based and implicitly authenticated key agreement protocol IDAK based on pairing techniques. Though both Weil and Tate pairing could be used for IDAK, we recommend Tate pairing for IDAK to avoid extra ephemeral value validation process. The security of IDAK was formally proved in [22] in Bellare-Rogaway model with random oracle. In additon, ID...

متن کامل

Pairing-Based Two-Party Authenticated Key Agreement Protocol

To achieve secure data communications, two parties should be authenticated by each other and agree on a secret session key by exchanging messages over an insecure channel. In this paper, based on the bilinear pairing, we present a new two-party authenticated key agreement protocol, and use the techniques from provable security to examine the security of our protocol within Bellare-Rogaway model.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • JSW

دوره 8  شماره 

صفحات  -

تاریخ انتشار 2013